Enumerating colorings, tensions and flows in cell complexes
نویسندگان
چکیده
We study quasipolynomials enumerating proper colorings, nowherezero tensions, and nowhere-zero flows in an arbitrary CW-complex X, generalizing the chromatic, tension and flow polynomials of a graph. Our colorings, tensions and flows may be either modular (with values in Z/kZ for some k) or integral (with values in {−k + 1, . . . , k − 1}). We obtain deletion-contraction recurrences and closed formulas for the chromatic, tension and flow quasipolynomials, assuming certain unimodularity conditions. We use geometric methods, specifically Ehrhart theory and inside-out polytopes, to obtain reciprocity theorems for all of the aforementioned quasipolynomials, giving combinatorial interpretations of their values at negative integers as well as formulas for the numbers of acyclic and totally cyclic orientations of X.
منابع مشابه
A Method for Generating Colorings over Graph Automorphism
Given a graphG = (V,E) with a setW ⊆ V of vertices, we enumerate colorings to W such that for every two enumerated colorings c and c′ the corresponding colored graphs (G, c) and (G, c′) are not isomorphic. This problem has an important application in the study of isomers of chemical graphs such as generation of benzen isomers from a tree-like chemical graph structure. The number of such colorin...
متن کاملPerfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کاملA Survey of Anticancer Effect of Some Five- and Six-Membered Palladium (II) Complexes (Containing Bidentate Phosphorus Ligands) on Caco-2 Colon Cancer Cell Line
Background and Objectives: Transition metal complexes possess a variety of biological and pharmacological activities, such as antitumor, antimicrobial, anti-inflammatory, anti-diabetic, and free radical scavenging. Many studies have been carried out on platinum-based chemotherapy agents, however, most attention has been paid to non-platinum metal-based agents in order to find different metal comp...
متن کاملCounting dominating sets and related structures in graphs
We first consider some problems related to the maximum number of dominating (or strong dominating) sets in a regular graph. Our techniques, centered around Shearer’s entropy lemma, extend to a reasonably broad class of graph parameters enumerating vertex colorings that satisfy conditions on the multiset of colors appearing in neighborhoods (either open or closed). Dominating sets and strong dom...
متن کاملOn the Number of Synchronizing Colorings of Digraphs
We deal with k-out-regular directed multigraphs with loops (called simply digraphs). The edges of such a digraph can be colored by elements of some fixed k-element set in such a way that outgoing edges of every vertex have different colors. Such a coloring corresponds naturally to an automaton. The road coloring theorem states that every primitive digraph has a synchronizing coloring. In the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 122 شماره
صفحات -
تاریخ انتشار 2014